Connected Restrained Detour Number of a Graph

نویسندگان

چکیده

Objectives: To find the connected restrained detour number for standard graphs and mesh graphs. Methods: By determining set with minimum cardinality, of a graph is investigated. Findings: We study that altered when we add pendent vertices. The maximum degree vertices are deleted computed. Novelty: Finding path plays vital role in network-based systems. Planning largest route essential business, industries radio technologies. introduce new concept number. also exhibit bounds graph. Keywords: Detour Set; Number; Mesh Graphs; Connected Restrained Number

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The connected forcing connected vertex detour number of a graph

For any vertex x in a connected graph G of order p ≥ 2, a set S of vertices of V is an x-detour set of G if each vertex v in G lies on an x-y detour for some element y in S. A connected x-detour set of G is an x-detour set S such that the subgraph G[S] induced by S is connected. The minimum cardinality of a connected x-detour set of G is the connected x-detour number of G and is denoted by cdx(...

متن کامل

The Connected Detour Monophonic Number of a Graph

For a connected graph G = (V,E) of order at least two, a chord of a path P is an edge joining two non-adjacent vertices of P . A path P is called a monophonic path if it is a chordless path. A longest x− y monophonic path is called an x− y detour monophonic path. A set S of vertices of G is a detour monophonic set of G if each vertex v of G lies on an x − y detour monophonic path, for some x an...

متن کامل

The connected vertex detour number of a graph

For a connected graph G of order p ≥ 2 and a vertex x of G, a set S ⊆ V(G) is an x-detour set of G if each vertex v ∈ V(G) lies on an x − y detour for some element y in S. The minimum cardinality of an xdetour set of G is defined as the x-detour number of G, denoted by dx(G). An x-detour set of cardinality dx(G) is called a dx-set of G. A connected x-detour set of G is an x-detour set S such th...

متن کامل

Bounds on the restrained Roman domination number of a graph

A {em Roman dominating function} on a graph $G$ is a function$f:V(G)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}A {em restrained Roman dominating}function} $f$ is a {color{blue} Roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} The wei...

متن کامل

connected cototal domination number of a graph

a dominating set $d subseteq v$ of a graph $g = (v,e)$ is said to be a connected cototal dominating set if $langle d rangle$ is connected and $langle v-d rangle neq phi$, contains no isolated vertices. a connected cototal dominating set is said to be minimal if no proper subset of $d$ is connected cototal dominating set. the connected cototal domination number $gamma_{ccl}(g)$ of $g$ is the min...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Indian journal of science and technology

سال: 2023

ISSN: ['0974-5645', '0974-6846']

DOI: https://doi.org/10.17485/ijst/v16i1.1875